中段反导指挥控制能力生成机理及构成分析

提出了中段反导指挥控制能力生成的要素基础建设机理、要素集成聚优机理和要素联动涌效机理,构建了中段反导指挥控制能力总体构成框架,并对作战能力具体构成进行了分析,可为反导指挥控制系统建设及作战效能评估提供借鉴。     

基于全局时态逻辑(GTL)的验证和测试生成研究

基于时态逻辑,定义了标准的逻辑操作公式、公理和扩展定理。根据测试生成和验证所要求的初始特性,提出了全局时态逻辑（Global Temporal Logic）GTL,避免了验证和测试中的回溯问题,从而提高验证和测试的效率。另外根据电路节点的扇入和扇出特性,介绍了利用时序线等启发知识来提高搜索策略的方法。     

基于状态变换的数字电路冗余确认研究

以状态跳变图为基础,深入分析了冗余变换与非法变换的特征,提出结构冗余和功能冗余的概念,并讨论了可测故障、不可测故障和冗余之间的联系.最后结合验证和测试生成,提出状态冗余的隐含遍历确认策略.     

Poisson方程生成数值网格方法中的源项计算法

网格生成是数值研究方法得以实现的基础。本文采用了Ｐｏｉｓｓｏｎ方程生成数值网格，并针对方程源项的选择问题，对两种形式的源项作了比较研究。     

基于DAC5686的线性调频信号产生方法研究

研究了基于DAC5686的线性调频信号产生方法。分析了线性调频信号及其产生原理,研究了DAC5686工作原理,设计了信号产生电路,给出了线性调频信号的实现实例．结果表明,该方法可以灵活地产生所需线性调频信号,从而满足某型地空导弹制导雷达中频接收机性能测试的需要．与传统的线性调频信号产生方法相比,该方法降低了系统设计难度,缩短了开发周期,提高了设计的可靠性,具有较高的实用价值,对于其它场合频线性调频信号的产生也具有一定的借鉴意义．     

Column generation for stochastic green telecommunication network planning with switchable base stations

We present the green telecommunication network planning problem with switchable base stations, where the location and configuration of the base stations are optimized, while taking into account uncertainty and variability of demand. The problem is formulated as a two‐stage stochastic program under demand uncertainty with integers in both stages. Since solving the presented problem is computationally challenging, we develop the corresponding Dantzig‐Wolfe reformulation and propose a solution approach based on column generation. Comprehensive computational results are provided for instances of varying characteristics. The results show that the joint location and dynamic switching of base stations leads to significant savings in terms of energy cost. Up to 30% reduction in power consumption cost is achieved while still serving all users. In certain cases, allowing dynamic configurations leads to more installed base stations and higher user coverage, while having lower total energy consumption. The Dantzig‐Wolfe reformulation provides solutions with a tight LP‐gap eliminating the need for a full branch‐and‐price scheme. Furthermore, the proposed column generation solution approach is computationally efficient and outperforms CPLEX on the majority of the tested instances. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 351–366, 2016     

复杂平面区域的三角网格生成算法

为生成复杂平面区域的有限元网格,提出了基于网格细化的三角网格生成算法.该算法首先采用耳尖移除法对区域边界做三角划分,得到粗略的初始网格.提出Delaunay优化平分方法,根据网格密度细化初始网格,该网格细化方法结合最长边平分技术与Delaunay边交换技术,可有效提高内点生成与单元细分的质量.实验表明,基于Delaunay 优化平分的三角网格生成算法可对任意平面域进行网格剖分,生成符合有限元计算要求的高质量三角网格.     

协议测试中测试序列生成方法综述

文章在介绍协议一致性测试基本概念的基础上,重点列举了测试序列的几种生成方法。对目前广泛采用的形式化描述模型,重点介绍其中基于有限状态机模型的测试序列生成方法,同时对基于扩展有限状态机以及确定有限状态机的测试序列生成方法也进行了介绍。文章对每一种方法介绍了其原理并分析了其使用中的局限。文章最后指出了在协议测试中面临的问题和进一步研究的方向。     

党的第三代领导集体对正确处理人民内部矛盾理论的丰富和发展

以江泽民为核心的党的第三代领导集体,在建立社会主义市场经济的形势下,进一步丰富和发展了毛泽东正确处理人民内部矛盾的理论。主要表现在:深化了对正确处理人民内部矛盾重要意义的认识,开拓了正确认识人民内部矛盾的新领域,发展了依法正确处理人民内部矛盾的思想,以公开、公平、公正为准则领导了正确处理人民内部矛盾的新实践。     

Cyclic preference scheduling for nurses using branch and price

This paper presents a new methodology to solve the cyclic preference scheduling problem for hourly workers. The focus is on nurse rostering but is applicable to any organization in which the midterm scheduling decision must take into account a complex of legal, institutional, and preferential constraints. The objective is to strike a balance between satisfying individual preferences and minimizing personnel costs. The common practice is to consider each planning period independently and to generate new rosters at the beginning of each. To reduce some of the instability in the process, there is a growing trend toward cyclic schedules, which are easier to manage and are generally perceived to be more equitable. To address this problem, a new integer programming model is presented that combines the elements of both cyclic and preference scheduling. To find solutions, a branch‐and‐price algorithm is developed that makes use of several branching rules and an extremely effective rounding heuristic. A unique feature of the formulation is that the master problem contains integer rather than binary variables. Computational results are reported for problem instances with up to 200 nurses. Most were solved within 10 minutes and many within 3 minutes when a double aggregation approach was applicable. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007.